Adaptive control algorithm for linear object with arbitrary relative degree
نویسندگان
چکیده
منابع مشابه
Sampled-data iterative learning control for nonlinear systems with arbitrary relative degree
In this paper, a sampled-data iterative learning control method is proposed for nonlinear systems without restriction on system relative degree. The learning algorithm does not require numerical di!erentiations of any order from the tracking error. A su$cient condition is derived to guarantee the convergence of the system output at each sampling instant to the desired trajectory. Numerical simu...
متن کاملGlobal Output-Feedback Extremum Seeking Control for Nonlinear Systems with Arbitrary Relative Degree
An output-feedback sliding mode based extremum seeking controller was recently introduced for linear uncertain systems by using periodic switching functions. Nonlinear systems were also considered but restricted to relative degree one plants as well as the former linear case. Here, generalization is achieved to include more general dynamics with arbitrary relative degree. Global stability prope...
متن کاملAnticipatory iterative learning control for nonlinear systems with arbitrary relative degree
[14] G. De Nicolao, L. Magni, and R. Scattolini, “Stabilizing receding-horizon control of nonlinear time-varying systems,” IEEE Trans. Automat. Contr., vol. 43, pp. 1030–1036, July 1998. [15] T. Parisini and R. Zoppoli, “A receding horizon regulator for nonlinear systems and a neural approximation,” Automatica, vol. 31, pp. 1443–1451, 1995. [16] J. A. Primbs, V. Nevistić, and J. C. Doyle, “A re...
متن کاملPerformance Bounds in H∞ Optimal Control for Stable SISO Plants With Arbitrary Relative Degree
This note deals with performance bounds for the -optimal control of discrete-time LTI plants. The case studied corresponds to stable scalar plants with arbitrary relative degree but no finite non-minimum phase zero. By using Nehari’s Theorem and a reformulation of the standard Youla Parameterization a closed-form expression for the characteristic polynomial of the associated eigenvalue problem ...
متن کاملA new algorithm for computing SAGBI bases up to an arbitrary degree
We present a new algorithm for computing a SAGBI basis up to an arbitrary degree for a subalgebra generated by a set of homogeneous polynomials. Our idea is based on linear algebra methods which cause a low level of complexity and computational cost. We then use it to solve the membership problem in subalgebras.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Izvestiâ vysših učebnyh zavedenij. Priborostroenie
سال: 2015
ISSN: 0021-3454
DOI: 10.17586/0021-3454-2015-58-9-687-693